By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Volume 11, Issue 2, pp. 183-346

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

An Optimal Acceptance Policy for an Urn Scheme

Robert W. Chen, Alan Zame, Andrew M. Odlyzko, and Larry A. Shepp

pp. 183-195

The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover

Jon Kleinberg and Michel X. Goemans

pp. 196-204

On Perfect Codes and Tilings: Problems and Solutions

Tuvi Etzion and Alexander Vardy

pp. 205-223

Sorting by Transpositions

Vineet Bafna and Pavel A. Pevzner

pp. 224-240

Perfect Factors from Cyclic Codes and Interleaving

Chris J. Mitchell and Kenneth G. Paterson

pp. 241-264

Isomorphism Classes of Concrete Graph Coverings

Rongquan Feng, Jin Ho Kwak, Juyoung Kim, and Jaeun Lee

pp. 265-272

Enumeration of Regular Graph Coverings Having Finite Abelian Covering Transformation Groups

Jin Ho Kwak, Jang-Ho Chun, and Jaeun Lee

pp. 273-285

A Note on Counting Connected Graph Covering Projections

Michael Hofmeister

pp. 286-292

A Generalized Distance in Graphs and Centered Partitions

Cristian Lenart

pp. 293-304

Cayley Digraphs Based on the de Bruijn Networks

M. Espona and O. Serra

pp. 305-317

A Greedy Algorithm Estimating the Height of Random Trees

Tomasz Luczak

pp. 318-329

Circulants and Sequences

Karen L. Collins

pp. 330-339

Semikernels and (k,l)-Kernels in Digraphs

H. Galeana-Sánchez and Xueliang Li

pp. 340-346